Eecient Incremental Garbage Collection for Workstation/server Database Systems

نویسندگان

  • Laurent Amsaleg
  • Michael Franklin
  • Olivier Gruber
چکیده

We describe an eecient server-based algorithm for garbage collecting object-oriented databases in a workstation/server environment. The algorithm is incremental and runs concurrently with client transactions, however, it does not hold any locks on data and does not require callbacks to clients. It is fault tolerant, but performs very little logging. The algorithm has been designed to be integrated into existing OODB systems, and therefore it works with standard implementation techniques such as two-phase locking and write-ahead-logging. In addition, it supports client-server performance optimizations such as client caching and exible management of client buuers. We describe an implementation of the algorithm in the EXODUS storage manager and present results from an initial performance study of the implementation. These results demonstrate that the introduction of the garbage collector adds minimal overhead to client operations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Incremental Garbage Collection for Workstation/Server Database Systems

We describe an eecient server-based algorithm for garbage collecting object-oriented databases in a workstation/server environment. The algorithm is incremental and runs concurrently with client transactions, however, it does not hold any locks on data and does not require callbacks to clients. It is fault tolerant, but performs very little logging. The algorithm has been designed to be integra...

متن کامل

Efficient Incremental Garbage Collection for Client-Server Object Database Systems

We describe an eficient server-based algorithm for garbage collecting object-oriented databases in a client/server environment. The algorithm is incremental and runs concurrently with client transactions. Unlike previous algorithms, it does not hold any locks on data and does not require callbacks to clients. It is fault tolerant, but performs very little logging. The algorithm has been designe...

متن کامل

Garbage Collection of Persistent Objects in Distributed Shared Memory

This paper describes a garbage collection algorithm for distributed persistent objects in a loosely coupled network of workstations. Objects are accessed via a weakly consistent shared distributed virtual memory with recoverable properties. We address the speciic problem of garbage collecting a large amount of distributed persistent objects, cached on several nodes for eecient sharing. For clus...

متن کامل

SIP server performance on multicore systems

multicore systems C. P. Wright E. M. Nahum D. Wood J. M. Tracey E. C. Hu This paper evaluates the performance of a popular open-source Session Initiation Protocol (SIP) server on three different multicore architectures. We examine the baseline performance and introduce three analysis-driven optimizations that involve increasing the number of slots in hash tables, an in-memory database for user ...

متن کامل

Recycling in Gardens: E cient Memory Management for a Parallel System

Gardens is a system which supports parallel computation across networks of workstations. This is achieved by over decomposing a program into more tasks than there are processors. Tasks have separate heaps which comprise partitions (segments) of a global address space. Gardens supports a modern object oriented programming language which requires garbage collection. Furthermore since tasks may be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994